The Automorphism Group of a Product of Graphs
نویسنده
چکیده
In a recent paper we showed that every connected graph can be written as a weak cartesian product of a family of indecomposable rooted graphs and that this decomposition is unique to within isomorphisms. Using this unique prime factorization theorem we prove that if a graph X can be written as a product of connected rooted graphs, which are pairwise relatively prime, then the automorphism group of X is isomorphic to the restricted direct product of the automorphism groups of the factors with prescribed subgroups the isotropy groups of the factors at the roots. This is a generalization of Sabidussi's theorem for cartesian multiplication. Sabidussi [4] proved that if Xi, ■ ■ ■ , Xn are connected graphs of finite type which are pairwise relatively prime with respect to cartesian multiplication, then the automorphism group of the product is isomorphic to the direct product of the automorphism groups of the factors. The proof of this result uses the unique prime factorization theorem for cartesian multiplication. In [3] it was proved that, for connected graphs, unique prime factorization holds for weak cartesian multiplication. The purpose of this note is to generalize Sabidussi's Theorem to the weak cartesian product of a family of rooted graphs. Let iGa)a£A be a family of groups and for each aEA let Ha be a subgroup of GaThe restricted direct product of the family of groups (Ga)aeji with prescribed subgroups Ha is defined by IX (Go, Ha) = . a£A \ a£A 1 This product was introduced by Vilenkin [6] and can be found in Kuros [2]. For a subgraph Fof a graph X we use the notation of [5] and denote the subgroup of the automorphism group of X that leaves Y invariant by GiX; Y), that is, GiX; Y) = {Y = Y), where GiX) is the automorphism group of X. Hence G(A7; xa) denotes the isotropy group of Xa at xa. Our main result is the following: Theorem. Let (Xa, xa)aGA be a family of connected rooted graphs which are pairwise relatively prime. Then G(\\aeA (Xa, xa)) is isomorphic to Received by the editors July 30, 1969. A MS Subject Classifications. Primary 0562; Secondary 2022, 2052.
منابع مشابه
The automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کامل